Min-max and max-min graph saturation parameters
نویسندگان
چکیده
منابع مشابه
On MAX - MIN Ant System's Parameters
The impact of the values of the most meaningful parameters on the behavior of MAX–MIN Ant System is analyzed. Namely, we take into account the number of ants, the evaporation rate of the pheromone, and the exponent values of the pheromone trail and of the heuristic measure in the random proportional rule. We propose an analytic approach to examining their impact on the speed of convergence of t...
متن کاملMin, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملMax and min limiters
If A ⊆ ω, n ≥ 2, and the function max({x1, . . . , xn} ∩ A) is partial recursive, it is easily seen that A is recursive. In this paper, we weaken this hypothesis in various ways (and similarly for “min” in place of “max”) and investigate what effect this has on the complexity of A. We discover a sharp contrast between retraceable and coretraceable sets, and we characterize sets which are the un...
متن کاملDynamic Min-Max Problems
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t cou...
متن کاملMin - Max Heaps
,4 simple implementation of doubleended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2019.08.006